Splines and efficiency in dynamic programming
نویسندگان
چکیده
منابع مشابه
On Approximate Dynamic Programming with Multivariate Splines for Adaptive Control
We define a SDP framework based on the RLS TD algorithm and multivariate simplex B-splines. We introduce a local forget factor capable of preserving the continuity of the simplex splines. This local forget factor is integrated with the RLS TD algorithm, resulting in a modified RLS TD algorithm that is capable of tracking time-varying systems. We present the results of two numerical experiments,...
متن کاملGeometrically exact dynamic splines
In this paper, we propose a complete model handling physical simulation of deformable 1D objects. We formulate continuous expressions for stretching, bending and twisting energies. These expressions are mechanically rigorous and geometrically exact. Both elastic and plastic deformations are handled to simulate a wide range of materials. We validate the proposed model on several classical test c...
متن کاملGENETIC PROGRAMMING AND MULTIVARIATE ADAPTIVE REGRESION SPLINES FOR PRIDICTION OF BRIDGE RISKS AND COMPARISION OF PERFORMANCES
In this paper, two different data driven models, genetic programming (GP) and multivariate adoptive regression splines (MARS), have been adopted to create the models for prediction of bridge risk score. Input parameters of bridge risks consists of safe risk rating (SRR), functional risk rating (FRR), sustainability risk rating (SUR), environmental risk rating (ERR) and target output. The total ...
متن کاملFEM-Based Dynamic Subdivision Splines
Recent years have witnessed dramatic growth in the use of subdivision schemes for graphical modeling and animation, especially for the representation of smooth, oftentimes complex shapes of arbitrary topology. Nevertheless, conventional interactive approaches to subdivision objects can be extremely laborious and inefficient. Users must carefully specify the initial mesh and/or painstakingly man...
متن کاملProgramming Multigrid Methods with B-Splines
Multigrid algorithms are the method of choice for solving large Ritz-Galerkin systems for elliptic boundary value problems. Using b-spline bases provides geometric flexibility as well as many computational advantages and permits particularly efficient and elegant implementations. This is described for a fairly general discretization which covers all principal features of b-spline elements.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1976
ISSN: 0022-247X
DOI: 10.1016/0022-247x(76)90209-2